On the Normality of Arithmetical Constants
نویسنده
چکیده
Bailey and Crandall [4] recently formulated “Hypothesis A”, a general principle to explain the (conjectured) normality of the binary expansion of constants like π and other related numbers, or more generally the base b expansion of such constants for an integer b ≥ 2. This paper shows that a basic mechanism underlying their principle, which is a relation between single orbits of two discrete dynamical systems, holds for a very general class of representations of numbers. This general class includes numbers for which the conclusion of “Hypothesis A” is not true. The paper also relates the particular class of arithmetical constants treated by Bailey and Crandall to special values of G-functions, and points out an analogy of “Hypothesis A” with Furstenberg’s conjecture on invariant measures. AMS Subject Classification(2000): 11K16 (Primary) 11A63, 28D05, 37E05 (Secondary)
منابع مشابه
On Arithmetical Formulas Whose Jacobians Are Grr Obner Bases
We exhibit classes of polynomials whose sets of kth partial derivatives form Gro bner bases for all k, with respect to all term orders. The classes are deened by syntactic constraints on arithmetical formulas deening the polynomials. Read-once formulas without constants have this property for all k, while those with constants have a weaker \Grr obner-bounding" property introduced here. For k = ...
متن کاملOn Arithmetical Formulas Whose Jacobians are Gröbner Bases
We exhibit classes of polynomials whose sets of first partial derivatives form Gröbner bases, with respect to all term orders. The classes are defined by syntactic constraints on arithmetical formulas defining the polynomials. Read-once formulas without constants also have this property, while those with constants have a weaker “Gröbner-bounding” property introduced here. The same properties ho...
متن کاملOn Pseudorandomness in Families of Sequences Derived from the Legendre Symbol
Abstract. We construct a family of finite binary sequences which has a remarkable uniformity with respect to specification of several terms and which also has the property that every sequence in the family has small measures of normality, well distribution in arithmetical progressions and multiple correlations. We also construct a pseudorandom bit generator whose output consists of members of t...
متن کاملDefinability and Decision Problems in Arithmetic
Introduction. In this paper, we are concerned with the arithmetical definability of certain notions of integers and rationals in terms of other notions. The results derived will be applied to obtain a negative solution of corresponding decision problems. In Section 1, we show that addition of positive integers can be defined arithmetically in terms of multiplication and the unary operation of s...
متن کاملOn Equations over Sets of Integers
Systems of equations with sets of integers as unknowns are considered. It isshown that the class of sets representable by unique solutions of equations using the oper-ations of union and addition S + T = {m+ n |m ∈ S, n ∈ T} and with ultimately periodicconstants is exactly the class of hyper-arithmetical sets. Equations using addition only canrepresent every hyper-arithmetical s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Experimental Mathematics
دوره 10 شماره
صفحات -
تاریخ انتشار 2001